Tatami Maker: A combinatorially rich mechanical game board
نویسنده
چکیده
Japanese tatami mats are often arranged so that no four mats meet. This local restriction imposes a rich combinatorial structure when applied to monomino-domino coverings of rectilinear grids. We describe a modular, mechanical game board, prototyped with a desktop 3D printer, that enforces this restriction, and transforms tatami pen-andpaper puzzles into interactive sculptures. We review some recent mathematical discoveries on tatami coverings and present five new combinatorial games implemented on the game board.
منابع مشابه
Global Maker-Breaker games on sparse graphs
In this paper we consider Maker-Breaker games, played on the edges of sparse graphs. For a given graph property P we seek a graph (board of the game) with the smallest number of edges on which Maker can build a subgraph that satisfies P. In this paper we focus on global properties. We prove the following results: 1) for the positive minimum degree game, there is a winning board with n vertices ...
متن کاملContinuous Box game
The classical positional game Box was introduced by Chvátal and Erdős in 1978 in their study of the biased connectivity game on the complete graph. Their analysis was subsequently extended by Hamidoune and Las Vergnas. The board of the Box game consists of elements of n disjoint sets (boxes), which might vary in size. The game is played by two players, Maker and Breaker. Maker claims m board el...
متن کاملTHE CRITICAL BIAS FOR THE HAMILTONICITY GAME IS (1 + o(1))n/ lnn
A Maker-Breaker game is a triple (H, a, b), where H = (V,E) is a hypergraph with vertex set V , called the board of the game, and edge set E, a family of subsets of V called winning sets. The parameters a and b are positive integers, related to the so-called game bias. The game is played between two players, called Maker and Breaker, who change turns occupying previously unclaimed elements of V...
متن کاملFast Strategies In Maker-Breaker Games Played on Random Boards
In this paper we analyze classical Maker-Breaker games played on the edge set of a sparse random board G ∼ Gn,p. We consider the Hamiltonicity game, the perfect matching game and the k-connectivity game. We prove that for p(n) ≥ polylog(n)/n, the board G ∼ Gn,p is typically such that Maker can win these games asymptotically as fast as possible, i.e. within n+ o(n), n/2 + o(n) and kn/2 + o(n) mo...
متن کاملThe Positive Minimum Degree Game on Sparse Graphs
In this note we investigate a special form of degree games defined by D. Hefetz, M. Krivelevich, M. Stojaković and T. Szabó [4]. Usually the board of a graph game is the edge set of Kn, the complete graph on n vertices. Maker and Breaker alternately claim an edge, and Maker wins if his edges form a subgraph with prescribed properties; here a certain minimum degree. In the special form the board...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1301.5969 شماره
صفحات -
تاریخ انتشار 2013